Fused lasso for feature selection using structural information
نویسندگان
چکیده
Most state-of-the-art feature selection methods tend to overlook the structural relationship between a pair of samples associated with each dimension, which may encapsulate useful information for refining performance selection. Moreover, they usually consider candidate relevancy equivalent selected relevancy, and therefore, some less relevant features be misinterpreted as salient features. To overcome these issues, we propose new method based on graph-based representations Fused Lasso framework in this paper. Unlike approaches, our has two main advantages. First, it can accommodate through representation. Second, enhance trade-off individual one hand its redundancy pairwise other. This is achieved use applied reordered basis their relevance respect target feature. effectively solve optimization problem, an iterative algorithm developed identify most discriminative Experiments demonstrate that proposed approach outperform competitors benchmark datasets.
منابع مشابه
Exclusive Lasso for Multi-task Feature Selection
We propose a novel group regularization which we call exclusive lasso. Unlike the group lasso regularizer that assumes covarying variables in groups, the proposed exclusive lasso regularizer models the scenario when variables in the same group compete with each other. Analysis is presented to illustrate the properties of the proposed regularizer. We present a framework of kernel based multi-tas...
متن کاملSimultaneous Channel and Feature Selection of Fused EEG Features Based on Sparse Group Lasso
Feature extraction and classification of EEG signals are core parts of brain computer interfaces (BCIs). Due to the high dimension of the EEG feature vector, an effective feature selection algorithm has become an integral part of research studies. In this paper, we present a new method based on a wrapped Sparse Group Lasso for channel and feature selection of fused EEG signals. The high-dimensi...
متن کاملFeature selection using structural similarity
A new method of feature selection is developed, based on structural similarity. The topological neighborhood information about pairs of objects (or patterns), to partition(s), is taken into consideration while computing a measure of structural similarity. This is termed proximity, and is defined in terms of membership values. Multi-objective evolutionary optimization is employed to arrive at a ...
متن کاملFeature Selection Guided by Structural Information
In generalized linear regression problems with an abundant number of features, lasso-type regularization which imposes an `-constraint on the regression coefficients has become a widely established technique. Crucial deficiencies of the lasso were unmasked when Zhou and Hastie (2005) introduced the elastic net. In this paper, we propose to extend the elastic net by admitting general nonnegative...
متن کاملFused Multiple Graphical Lasso
In this paper, we consider the problem of estimating multiple graphical models simultaneously using the fused lasso penalty, which encourages adjacent graphs to share similar structures. A motivating example is the analysis of brain networks of Alzheimer’s disease using neuroimaging data. Specifically, we may wish to estimate a brain network for the normal controls (NC), a brain network for the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Pattern Recognition
سال: 2021
ISSN: ['1873-5142', '0031-3203']
DOI: https://doi.org/10.1016/j.patcog.2021.108058